Tight Upper Bounds for Cell Loss Probabilities in ATM Multiplexers and Required Bandwidth Estimation
نویسندگان
چکیده
Estimating the cell loss probability in an ATM multi plexer is a key issue in network management and tra c control such as call admission control and bandwidth al location In this paper we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of hetero geneous on o sources with exponentially distributed on and o periods Based on this approximation a sim ple and accurate method is proposed to estimate the ag gregate required bandwidth by a given mix of tra c to guarantee a given cell loss probability
منابع مشابه
Tight upper bounds for cell loss probabilitiesand required bandwidth estimation in
Estimating the cell loss probability in an ATM multiplexer is a key issue in network management and traac control tasks such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources. Based on this approximation, a simple...
متن کاملTight Upper Bounds for Cell Loss Probabilities in ATM Multiplexersand Required
Estimating the cell loss probability in an ATM multi-plexer is a key issue in network management and traac control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources with exponentially distributed on and oo pe...
متن کاملTight Upper Bounds for Cell Loss Probabilities in ATM
Estimating the cell loss probability in an ATM multi-plexer is a key issue in network management and traac control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources with exponentially distributed on and oo pe...
متن کاملEstimation of Buffer Overflow Probabilities and Economies of Scale in ATM Multiplexers by Analysis of a Model of Packetized Voice Traffic
Estimation of Buffer Overflow Probabilities and Economies of Scale in ATM M ultiplexers by Analysis of a M odel of Packetized Voice Traffic by Paul J. Farrell We obtain upper bounds on the probability of buffer overflow for an ATM multiplexer of L identical packetized voice sources The multiplexer is modelled by a FCFS single server queue The arrivals at the multiplexer are a homogenous superpo...
متن کاملFundamental Bounds and Approximations for ATM Multiplexers with Applications to Video Teleconferencing
The main contributions of this paper are twofold. First, we prove fundamental, similarly behaving lower and upper bounds, and give an approximation based on the bounds, which is eeective for analyzing ATM multiplexers, even when the traac has many, possibly heterogeneous, sources and their models are of high dimension. Second, we apply our analytic approximation to statistical models of video t...
متن کامل